A Weighted Minimum Distance Using Hybridization of Particle Swarm Optimization and Bacterial Foraging

نویسنده

  • Muhammad Marwan Muhammad Fuad
چکیده

In a previous work we used a popular bio-inspired algorithm; particle swam optimization (PSO) to improve the performance of a well-known representation method of time series data which is the symbolic aggregate approximation (SAX), where PSO was used to propose a new weighted minimum distance WMD for SAX to recover some of the information loss resulting from the original minimum distance MINDIST on which SAX is based. WMD sets different weights to different segments of the time series according to their information content, where these weights are determined using PSO. We showed how SAX in conjunction with WMD can give better results in times series classification than the original SAX which uses MINDIST. In this paper we revisit this problem and propose optimizing WMD by using a hybrid of PSO and another bio-inspired optimization method which is Bacterial Foraging (BF); an effective bio-inspired optimization algorithm in solving difficult optimization problems. We show experimentally how by using this hybrid to set the weights of WMD we can obtain better classification results than those obtained when using PSO to set these weights.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Coevolutionary Bacterial Foraging Model Using PSO in Job- Shop Scheduling Environments

The optimization of job-shop scheduling is very important because of its theoretical and practical significance. In this paper, a computationally effective approach of combining bacterial foraging strategy with particle swarm optimization for solving the minimum makespan problem of job shop scheduling is proposed. In the artificial bacterial foraging system, a novel chemotactic model is designe...

متن کامل

Control of nonlinear systems using a hybrid APSO-BFO algorithm: An optimum design of PID controller

This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

متن کامل

Control of nonlinear systems using a hybrid APSO-BFO algorithm: An optimum design of PID controller

This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

متن کامل

Auto-Clustering Using Particle Swarm Optimization and Bacterial Foraging

This paper presents a hybrid approach for clustering based on particle swarm optimization (PSO) and bacteria foraging algorithms (BFA). The new method AutoCPB (Auto-Clustering based on particle bacterial foraging) makes use of autonomous agents whose primary objective is to cluster chunks of data by using simplistic collaboration. Inspired by the advances in clustering using particle swarm opti...

متن کامل

A Hybrid of Bacterial Foraging Optimization and Particle Swarm Optimization for Evolutionary Neural Fuzzy Classifier

This study presents a new evolutionary learning algorithm to optimize the parameters of the neural fuzzy classifier (NFC). This new evolutionary learning algorithm is based on a hybrid of bacterial foraging optimization and particle swarm optimization. It is thus called bacterial foraging particle swarm optimization (BFPSO). The proposed BFPSO method performs local search through the chemotacti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014